Sciweavers

492 search results - page 37 / 99
» A Failure to Learn from the Past
Sort
View
SIGCOMM
2000
ACM
14 years 26 days ago
When the CRC and TCP checksum disagree
Traces of Internet packets from the past two years show that between 1 packet in 1,100 and 1 packet in 32,000 fails the TCP checksum, even on links where link-level CRCs should ca...
Jonathan Stone, Craig Partridge
CVPR
2007
IEEE
14 years 13 days ago
Diverse Active Ranking for Multimedia Search
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
ShyamSundar Rajaram, Charlie K. Dagli, Nemanja Pet...
PASTE
2010
ACM
14 years 1 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
ICCV
2003
IEEE
14 years 10 months ago
A Caratheodory-Fejer Approach to Robust Multiframe Tracking
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...
Octavia I. Camps, Hwasup Lim, Cecilia Mazzaro, Mar...
COCOON
2001
Springer
14 years 1 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer