216 search results - page 42 / 44 » From Constraints to Finite Automata to Filtering Algorithms |
KDD
2008
ACM
14 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
A dynamically reconfigurable processor (DRP) is designed to achieve high area efficiency by switching reconfigurable data paths dynamically. Our DRP architecture has a stand alone...
TSP
2008
13 years 7 months ago
2008
In this paper, we consider an uplink multiple-antenna Code-Division Multiple-Access (CDMA) system linking several multiple-antenna mobile users to one multiple-antenna base-statio...