Sciweavers

6142 search results - page 661 / 1229
» The Complexity of Partition Functions
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
16 years 1 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
DATE
2007
IEEE
155views Hardware» more  DATE 2007»
16 years 1 months ago
Design fault directed test generation for microprocessor validation
Functional validation of modern microprocessors is an important and complex problem. One of the problems in functional validation is the generation of test cases that has higher p...
Deepak Mathaikutty, Sandeep K. Shukla, Sreekumar V...
COLT
2007
Springer
16 years 1 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
DAGM
2007
Springer
16 years 1 months ago
Curvature Guided Level Set Registration Using Adaptive Finite Elements
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
Andreas Dedner, Marcel Lüthi, Thomas Albrecht...
ESOP
2007
Springer
16 years 1 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari