Sciweavers

310 search results - page 3 / 62
» From Non-Negative to General Operator Cost Partitioning
Sort
View
IANDC
2008
114views more  IANDC 2008»
13 years 8 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
SIGCOMM
2009
ACM
14 years 3 months ago
ROAR: increasing the flexibility and performance of distributed search
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
TSP
2008
149views more  TSP 2008»
13 years 8 months ago
Decentralized Quantized Kalman Filtering With Scalable Communication Cost
Estimation and tracking of generally nonstationary Markov processes is of paramount importance for applications such as localization and navigation. In this context, ad hoc wireles...
Eric J. Msechu, Stergios I. Roumeliotis, Alejandro...
EOR
2007
198views more  EOR 2007»
13 years 8 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
CIKM
2009
Springer
14 years 3 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...