Sciweavers

2635 search results - page 128 / 527
» Algorithms for the Database Layout Problem
Sort
View
DATAMINE
2002
169views more  DATAMINE 2002»
15 years 4 months ago
Advances in Instance Selection for Instance-Based Learning Algorithms
The basic nearest neighbour classifier suffers from the indiscriminate storage of all presented training instances. With a large database of instances classification response time ...
Henry Brighton, Chris Mellish
ICASSP
2008
IEEE
15 years 11 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu
SIGMOD
2005
ACM
212views Database» more  SIGMOD 2005»
16 years 4 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...
DEXA
2008
Springer
87views Database» more  DEXA 2008»
15 years 6 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
DAC
2001
ACM
16 years 5 months ago
Performance-Driven Multi-Level Clustering with Application to Hierarchical FPGA Mapping
In this paper, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We first show that the performance-driven m...
Jason Cong, Michail Romesis