Sciweavers

2031 search results - page 288 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
DAC
2005
ACM
15 years 11 months ago
MP core: algorithm and design techniques for efficient channel estimation in wireless applications
Channel estimation and multiuser detection are enabling technologies for future generations of wireless applications. However, sophisticated algorithms are required for accurate c...
Yan Meng, Andrew P. Brown, Ronald A. Iltis, Timoth...
IROS
2009
IEEE
161views Robotics» more  IROS 2009»
15 years 4 months ago
Accurate shape-based 6-DoF pose estimation of single-colored objects
— The problem of accurate 6-DoF pose estimation of 3D objects based on their shape has so far been solved only for specific object geometries. Edge-based recognition and trackin...
Pedram Azad, Tamim Asfour, Rüdiger Dillmann
ANCS
2006
ACM
15 years 3 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
SIGMOD
2011
ACM
270views Database» more  SIGMOD 2011»
14 years 21 days ago
Automatic discovery of attributes in relational databases
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
Meihui Zhang, Marios Hadjieleftheriou, Beng Chin O...