Sciweavers

1390 search results - page 135 / 278
» Computing the depth of a flat
Sort
View
TCS
2010
14 years 8 months ago
A combinatorial approach to the analysis of bucket recursive trees
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
Markus Kuba, Alois Panholzer
GPC
2009
Springer
14 years 7 months ago
Process-Oriented Enterprise Mashups
Mashups, a new web 2.0 technology provide the ability for easy creation of web-based applications by end-users. The uses of the mashups are often consumer related. In this paper w...
Paul de Vrieze, Lai Xu, Athman Bouguettaya, Jian Y...
CVPR
2000
IEEE
16 years 11 hour ago
Parallel Projections for Stereo Reconstruction
This paper proposes a novel technique to computing geometric information from images captured under parallel projections. Parallel images are desirable for stereo reconstruction b...
Jinxiang Chai, Heung-Yeung Shum
HPCA
2007
IEEE
15 years 10 months ago
Illustrative Design Space Studies with Microarchitectural Regression Models
We apply a scalable approach for practical, comprehensive design space evaluation and optimization. This approach combines design space sampling and statistical inference to ident...
Benjamin C. Lee, David M. Brooks
SAC
2004
ACM
15 years 3 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...