4013 search results - page 750 / 803 » computing 2002 |
119
Voted
ML
2002
ACM
15 years 5 days ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
108
click to vote
TCSV
2002
15 years 4 days ago
2002
This paper presents a new 3-D subband coding framework that is able to achieve a good balance between high compression performance and channel error resilience. Various data transf...
131
click to vote
MOBIHOC
2002
ACM
16 years 3 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
111
click to vote
DAC
2002
ACM
16 years 1 months ago
2002
ACM
Previous work on DRAM power-mode management focused on hardware-based techniques and compiler-directed schemes to explicitly transition unused memory modules to low-power operatin...