Sciweavers

2181 search results - page 385 / 437
» The restriction scaffold problem
Sort
View
STACS
2005
Springer
14 years 2 months ago
Kolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
Wolfgang Merkle, Joseph S. Miller, André Ni...
SPAA
2004
ACM
14 years 2 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
CIKM
2004
Springer
14 years 2 months ago
Event threading within news topics
With the overwhelming volume of online news available today, there is an increasing need for automatic techniques to analyze and present news to the user in a meaningful and effi...
Ramesh Nallapati, Ao Feng, Fuchun Peng, James Alla...
ECCV
2004
Springer
14 years 2 months ago
Biometric Sensor Interoperability: A Case Study in Fingerprints
The problem of biometric sensor interoperability has received limited attention in the literature. Most biometric systems operate under the assumption that the data (viz., images) ...
Arun Ross, Anil K. Jain
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang