default search action
Gila Kamhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Guy Azov, Tatiana Pelc, Adi Fledel Alon, Gila Kamhi:
Self-Improving Customer Review Response Generation Based on LLMs. CoRR abs/2405.03845 (2024) - 2020
- [c26]Ron M. Hecht, Ariel Telpaz, Gila Kamhi, Omer Tsimhoni, Aharon Bar-Hillel, Naftali Tishby:
Modeling the Effect of Driver's Eye Gaze Pattern Under Workload: Gaussian Mixture Approach. CogSci 2020
2010 – 2019
- 2019
- [c25]Ron M. Hecht, Ariel Telpaz, Gila Kamhi, Aharon Bar-Hillel, Naftali Tishby:
Information Constrained Control for Visual Detection of Important Areas. ICASSP 2019: 4080-4084 - [c24]Michael Baltaxe, Ruben Mergui, Kobi Nistel, Gila Kamhi:
Marker-less Vision-based Detection of Improper Seat Belt Routing. IV 2019: 783-789 - 2018
- [c23]Ariel Telpaz, Michael Baltaxe, Ron M. Hecht, Guy Cohen-Lazry, Asaf Degani, Gila Kamhi:
An Approach for Measurement of Passenger Comfort: Real-Time Classification based on In-Cabin and Exterior Data. ITSC 2018: 223-229 - 2014
- [c22]Sinem Aslan, Zehra Cataltepe, Itai Diner, Onur Dundar, Asli Arslan Esme, Ron Ferens, Gila Kamhi, Ece Oktay, Canan Soysal, Murat Yener:
Learner Engagement Measurement and Classification in 1: 1 Learning. ICMLA 2014: 545-552 - 2011
- [c21]Eman Copty, Gila Kamhi, Sasha Novakovsky:
Transaction level statistical analysis for efficient micro-architectural power and performance studies. DAC 2011: 351-356 - 2010
- [c20]Pinkesh J. Shah, Yoni Aizik, Muhammad K. Mhameed, Gila Kamhi:
Challenges and methodologies for efficient power budgeting across the die. ACM Great Lakes Symposium on VLSI 2010: 317-322
2000 – 2009
- 2009
- [j2]Roni Wiener, Gila Kamhi, Moshe Y. Vardi:
Intelligate: An Algorithm for Learning Boolean Functions for Dynamic Power Reduction. J. Low Power Electron. 5(1): 106-112 (2009) - [c19]Gila Kamhi, Alexander Novakovsky, Andreas Tiemeyer, Adriana Wolffberg:
MAGENTA: transaction-based statistical micro-architectural root-cause analysis. DAC 2009: 639-643 - 2008
- [c18]Ranan Fraer, Gila Kamhi, Muhammad K. Mhameed:
A new paradigm for synthesis and propagation of clock gating conditions. DAC 2008: 658-663 - [c17]Deian Tabakov, Gila Kamhi, Moshe Y. Vardi, Eli Singerman:
A Temporal Language for SystemC. FMCAD 2008: 1-9 - [c16]Roni Wiener, Gila Kamhi, Moshe Y. Vardi:
Intelligate: Scalable Dynamic Invariant Learning for Power Reduction. PATMOS 2008: 52-61 - [c15]Yoni Aizik, Gila Kamhi, Yael Zbar, Hadas Ronen, Muhammad Abozaed:
Power-Aware Design via Micro-architectural Link to Implementation. PATMOS 2008: 72-81 - 2007
- [c14]Gila Kamhi, Sarah Miller, Stephen Bailey Mentor, Wolfgang Nebel, Y. C. Wong, Juergen Karmann, Enrico Macii, Stephen V. Kosonocky, Steve Curtis:
Early Power-Aware Design & Validation: Myth or Reality? DAC 2007: 210-211 - [c13]Pietro Babighian, Gila Kamhi, Moshe Y. Vardi:
Interactive presentation: PowerQuest: trace driven data mining for power optimization. DATE 2007: 1078-1083 - 2004
- [c12]Zvi Terem, Gila Kamhi, Moshe Y. Vardi, Amitai Irron:
Pattern search in hierarchical high-level designs. ICECS 2004: 519-522 - 2003
- [j1]Fady Copty, Amitai Irron, Osnat Weissberg, Nathan P. Kropp, Gila Kamhi:
Efficient debugging in a formal verification environment. Int. J. Softw. Tools Technol. Transf. 4(3): 335-348 (2003) - [c11]Marcelo Glusman, Gila Kamhi, Sela Mador-Haim, Ranan Fraer, Moshe Y. Vardi:
Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation. TACAS 2003: 176-191 - 2002
- [c10]Scott Hazelhurst, Osnat Weissberg, Gila Kamhi, Limor Fix:
A hybrid verification approach: getting deep into the design. DAC 2002: 111-116 - [c9]Ranan Fraer, Shahid Ikram, Gila Kamhi, Tim Leonard, Abdel Mokkedem:
Accelerated verification of RTL assertions based on satisfiability solvers. HLDVT 2002: 107-110 - 2001
- [c8]Fady Copty, Limor Fix, Ranan Fraer, Enrico Giunchiglia, Gila Kamhi, Armando Tacchella, Moshe Y. Vardi:
Benefits of Bounded Model Checking at an Industrial Setting. CAV 2001: 436-453 - [c7]Fady Copty, Amitai Irron, Osnat Weissberg, Nathan P. Kropp, Gila Kamhi:
Efficient Debugging in a Formal Verification Environment. CHARME 2001: 275-292 - [c6]Kathi Fisler, Ranan Fraer, Gila Kamhi, Moshe Y. Vardi, Zijiang Yang:
Is There a Best Symbolic Cycle-Detection Algorithm? TACAS 2001: 420-434 - 2000
- [c5]Ranan Fraer, Gila Kamhi, Barukh Ziv, Moshe Y. Vardi, Limor Fix:
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification. CAV 2000: 389-402
1990 – 1999
- 1999
- [c4]Ranan Fraer, Gila Kamhi, Limor Fix, Moshe Y. Vardi:
Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting. SMC@FLoC 1999: 11-22 - 1998
- [c3]Gila Kamhi, Limor Fix, Ziv Binyamini:
Symbolic Model Checking Visualization. FMCAD 1998: 290-303 - [c2]Gila Kamhi, Limor Fix:
Adaptive variable reordering for symbolic model checking. ICCAD 1998: 359-365 - 1997
- [c1]Gila Kamhi, Osnat Weissberg, Limor Fix:
Automatic Datapath Extraction for Efficient Usage of HDD. CAV 1997: 95-106
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint