4850 search results - page 690 / 970 » Approximate Data Structures with Applications |
153
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
168
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper describes an unsupervised learning technique for modeling human locomotion styles, such as distinct related activities (e.g. running and striding) or variations of the ...
164
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
180
click to vote
ICPR
2008
IEEE
16 years 17 days ago
2008
IEEE
This paper 1 proposes a technique for simplifying a given Gaussian mixture model, i.e. reformulating the density in a more parcimonious manner, if possible (less Gaussian componen...
144
Voted
DSN
2007
IEEE
16 years 14 days ago
2007
IEEE
— Device scaling and large integration increase the vulnerability of microprocessors to transient errors. One of the structures where errors can be most harmful is the register ï...