92 search results - page 9 / 19 » Fast Algorithms For Hierarchical Range Histogram Constructio... |
130
Voted
ICCAD
2008
IEEE
16 years 17 days ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
166
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
112
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Parallel programming is facilitated by constructs which, unlike the widely used SPMD paradigm, provide programmers with a global view of the code and data structures. These constr...
125
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
149
Voted
DEXAW
2010
IEEE
15 years 4 months ago
2010
IEEE
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...