2157 search results - page 82 / 432 » Optimal Fast Hashing |
149
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
176
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider a resource synthesis technique for realtime systems where the energy budget is limited and the performance of the system depends on how resources and energy are used. ...
158
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
231
click to vote
TON
2010
15 years 1 months ago
2010
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...