Sciweavers

2721 search results - page 455 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
MM
2010
ACM
164views Multimedia» more  MM 2010»
14 years 8 months ago
Visual search applications for connecting published works to digital material
Visual search connects physical (offline) objects with (online) digital media. Using objects from the environment, like newspapers, magazines, books and posters, we can retrieve s...
Jamey Graham, Jorge Moraleda, Jonathan J. Hull, Ti...
MST
2010
98views more  MST 2010»
14 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
SPIRE
2010
Springer
14 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TPDS
2010
135views more  TPDS 2010»
14 years 8 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 8 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...