Sciweavers

701 search results - page 140 / 141
» Self Bounding Learning Algorithms
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
NIPS
2003
13 years 8 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 9 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICDCS
2000
IEEE
13 years 12 months ago
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...
Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivas...
ROBOCUP
1999
Springer
115views Robotics» more  ROBOCUP 1999»
13 years 11 months ago
UBU Team
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...
Johan Kummeneje, David Lybäck, Håkan L....