Sciweavers

490 search results - page 76 / 98
» Impossibilities for roommate problems
Sort
View
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
CCA
2009
Springer
14 years 1 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 15 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
SAIG
2000
Springer
14 years 15 days ago
On Jones-Optimal Specialization for Strongly Typed Languages
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
Henning Makholm
USENIX
2001
13 years 10 months ago
A Waypoint Service Approach to Connect Heterogeneous Internet Address Spaces
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-...
T. S. Eugene Ng, Ion Stoica, Hui Zhang