Sciweavers

7930 search results - page 255 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
JMLR
2006
91views more  JMLR 2006»
15 years 6 months ago
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
We describe polynomial
Don R. Hush, Patrick Kelly, Clint Scovel, Ingo Ste...
SIGMOD
2005
ACM
212views Database» more  SIGMOD 2005»
16 years 6 months ago
A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
Philip Bohannon, Michael Flaster, Wenfei Fan, Raje...
HUMAN
2003
Springer
15 years 11 months ago
Admission Control for TCP Connections in QoS IP Network
The paper describes a new admission control (AC) algorithm for greedy TCP connections. The algorithm has passed positive tests in preproduction QoS IP network [2], developed inside...
Wojciech Burakowski, Halina Tarasiuk
ESWS
2011
Springer
14 years 10 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...