Sciweavers

1299 search results - page 235 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
TVLSI
2008
139views more  TVLSI 2008»
14 years 9 months ago
Ternary CAM Power and Delay Model: Extensions and Uses
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
Banit Agrawal, Timothy Sherwood
PLDI
2010
ACM
15 years 7 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
MOBICOM
2009
ACM
15 years 4 months ago
Data fusion improves the coverage of wireless sensor networks
Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important performance mea...
Guoliang Xing, Rui Tan, Benyuan Liu, Jianping Wang...
EDBT
2010
ACM
152views Database» more  EDBT 2010»
15 years 29 days ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 14 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...