Sciweavers

14078 search results - page 1933 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
UIST
2005
ACM
16 years 1 months ago
PlayAnywhere: a compact interactive tabletop projection-vision system
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
Andrew D. Wilson
193
Voted
MOBICOM
2003
ACM
16 years 28 days ago
Geographic routing without location information
For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e....
Ananth Rao, Christos H. Papadimitriou, Scott Shenk...
DIS
2003
Springer
16 years 28 days ago
Extraction of Coverings as Monotone DNF Formulas
Abstract. In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but al...
Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao
FPGA
2003
ACM
123views FPGA» more  FPGA 2003»
16 years 27 days ago
Wire type assignment for FPGA routing
The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently dev...
Seokjin Lee, Hua Xiang, D. F. Wong, Richard Y. Sun
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
16 years 9 days ago
Using performance fronts for parameter setting of stochastic metaheuristics
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
Johann Dréo
« Prev « First page 1933 / 2816 Last » Next »