Sciweavers

1085 search results - page 40 / 217
» Hug over a distance
Sort
View
FOCS
1999
IEEE
14 years 29 days ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
APPML
2007
154views more  APPML 2007»
13 years 8 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
MSN
2005
Springer
14 years 2 months ago
Population Estimation for Resource Inventory Applications over Sensor Networks
Abstract. The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size a...
Jiun-Long Huang
PKDD
2004
Springer
118views Data Mining» more  PKDD 2004»
14 years 2 months ago
Mining Thick Skylines over Large Databases
Abstract. People recently are interested in a new operator, called skyline [3], which returns the objects that are not dominated by any other objects with regard to certain measure...
Wen Jin, Jiawei Han, Martin Ester
FGCS
2006
110views more  FGCS 2006»
13 years 8 months ago
Seamless live migration of virtual machines over the MAN/WAN
The "VM Turntable" demonstrator at iGRID 2005 pioneered the integration of Virtual Machines (VMs) with deterministic "lightpath" network services across MAN/WA...
Franco Travostino, Paul Daspit, Leon Gommans, Chet...