Sciweavers

4137 search results - page 537 / 828
» On the number of matchings of a tree
Sort
View
ICIP
2009
IEEE
15 years 4 months ago
Object tracking using multiple fragments
This paper presents a low-cost tracking algorithm based on multiple multiple fragments, increasing robustness with respect to partial occlusions. Given the initial template repres...
Claudio R. Jung, Amir Said
ANCS
2010
ACM
15 years 4 months ago
A traffic-aware top-N firewall ruleset approximation algorithm
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...
Ho-Yu Lam, Donghan (Jarod) Wang, H. Jonathan Chao
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
15 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
TC
2011
15 years 1 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang
JMLR
2010
153views more  JMLR 2010»
15 years 1 months ago
Generalized Expectation Criteria for Semi-Supervised Learning with Weakly Labeled Data
In this paper, we present an overview of generalized expectation criteria (GE), a simple, robust, scalable method for semi-supervised training using weakly-labeled data. GE fits m...
Gideon S. Mann, Andrew McCallum