Sciweavers

16404 search results - page 2504 / 3281
» A set coverage problem
Sort
View
DIS
2009
Springer
16 years 2 months ago
Contrasting Sequence Groups by Emerging Sequences
Abstract. Group comparison per se is a fundamental task in many scientific endeavours but is also the basis of any classifier. Contrast sets and emerging patterns contrast betwee...
Kang Deng, Osmar R. Zaïane
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 2 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 2 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
EUROPAR
2009
Springer
16 years 2 months ago
Adaptive Parallel Householder Bidiagonalization
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
Fangbin Liu, Frank J. Seinstra
FMCAD
2009
Springer
16 years 2 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
« Prev « First page 2504 / 3281 Last » Next »