Sciweavers

2370 search results - page 167 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
COLT
2010
Springer
14 years 8 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
MOBIHOC
2008
ACM
15 years 9 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
CVPR
2005
IEEE
16 years 4 days ago
Semi-Supervised Cross Feature Learning for Semantic Concept Detection in Videos
For large scale automatic semantic video characterization, it is necessary to learn and model a large number of semantic concepts. But a major obstacle to this is the insufficienc...
Rong Yan, Milind R. Naphade
ICSE
2007
IEEE-ACM
15 years 10 months ago
DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. I...
Ghassan Misherghi, Lingxiao Jiang, Stéphane...
INFOCOM
2008
IEEE
15 years 4 months ago
Fair Scheduling through Packet Election
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
Srikanth Jagabathula, Vishal Doshi, Devavrat Shah