Sciweavers

4536 search results - page 897 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICSE
2008
IEEE-ACM
16 years 15 days ago
Answering conceptual queries with Ferret
Programmers seek to answer questions as they investigate the functioning of a software system, such as "which execution path is being taken in this case?" Programmers at...
Brian de Alwis, Gail C. Murphy
SIGSOFT
2007
ACM
16 years 13 days ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
WWW
2006
ACM
16 years 11 days ago
Constructing virtual documents for ontology matching
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
Yuzhong Qu, Wei Hu, Gong Cheng
CAV
2009
Springer
215views Hardware» more  CAV 2009»
16 years 7 days ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
15 years 12 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis