Sciweavers

5316 search results - page 363 / 1064
» Which Search Problems Are Random
Sort
View
SARA
2007
Springer
16 years 1 months ago
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
167
Voted
VRST
2005
ACM
16 years 1 months ago
Search and transitioning for motion captured sequences
Animators today have started using motion captured (mocap) sequences to drive characters. Mocap allows rapid acquisition of highly realistic animation data. Consequently animators...
Suddha Basu, Shrinath Shanbhag, Sharat Chandran
190
Voted
DAWAK
2001
Springer
15 years 12 months ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 7 months ago
Human Speed-Accuracy Tradeoffs in Search
When foraging for information, users face a tradeoff between the accuracy and value of the acquired information and the time spent collecting it, a problem which also surfaces whe...
Christina Aperjis, Bernardo A. Huberman, Fang Wu
JIIS
2002
141views more  JIIS 2002»
15 years 7 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...