Sciweavers

24 search results - page 2 / 5
» When do changes induce fixes
Sort
View
ICALP
1998
Springer
13 years 9 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
JILP
2000
103views more  JILP 2000»
13 years 5 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
ICRA
2008
IEEE
229views Robotics» more  ICRA 2008»
13 years 12 months ago
Learning of moving cast shadows for dynamic environments
Abstract— We propose a novel online framework for detecting moving shadows in video sequences using statistical learning techniques. In this framework, Support Vector Machines ar...
Ajay J. Joshi, Nikolaos Papanikolopoulos
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 5 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
ISBI
2009
IEEE
14 years 9 days ago
Multiple Hypothesis Tracking in Microscopy Images
Multiple hypothesis tracking (MHT) is a preferred technique for solving the data association problem in modern multiple target tracking systems. However in bioimaging applications...
Nicolas Chenouard, Isabelle Bloch, Jean-Christophe...