Sciweavers

230 search results - page 36 / 46
» Quantum Search with Variable Times
Sort
View
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 1 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
CP
2009
Springer
16 years 1 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
104
Voted
KDD
2006
ACM
175views Data Mining» more  KDD 2006»
16 years 26 days ago
A mixture model for contextual text mining
Contextual text mining is concerned with extracting topical themes from a text collection with context information (e.g., time and location) and comparing/analyzing the variations...
Qiaozhu Mei, ChengXiang Zhai
111
Voted
PERCOM
2007
ACM
16 years 1 days ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
100
Voted
CVPR
2010
IEEE
15 years 7 months ago
Scale-Hierarchical 3D Object Recognition in Cluttered Scenes
3D object recognition in scenes with occlusion and clutter is a difficult task. In this paper, we introduce a method that exploits the geometric scale-variability to aid in this ...
Prabin Bariya, Ko Nishino