Sciweavers

89 search results - page 17 / 18
» CP Models for Maximum Common Subgraph Problems
Sort
View
JAIR
2006
110views more  JAIR 2006»
13 years 6 months ago
Domain Adaptation for Statistical Classifiers
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applicati...
Hal Daumé III, Daniel Marcu
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 2 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
WWW
2009
ACM
14 years 7 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 7 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
INFOCOM
2005
IEEE
13 years 12 months ago
A beacon-less location discovery scheme for wireless sensor networks
— In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of l...
Lei Fang, Wenliang Du, Peng Ning