Sciweavers

7839 search results - page 1565 / 1568
» What is a
Sort
View
MLMI
2004
Springer
14 years 1 months ago
Towards Predicting Optimal Fusion Candidates: A Case Study on Biometric Authentication Tasks
Combining multiple information sources, typically from several data streams is a very promising approach, both in experiments and to some extend in various real-life applications. ...
Norman Poh, Samy Bengio
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
FMICS
2009
Springer
14 years 3 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
VAMOS
2007
Springer
14 years 2 months ago
A Plea for Help with Variability, in Two Acts
A short theatrical exaggeration (but not too much) which describes practical problems with variability as experienced by real-world software developers. Real issue, there are no p...
Reed Little, Randy Blohm
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
« Prev « First page 1565 / 1568 Last » Next »