Sciweavers

3838 search results - page 590 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
CHI
2008
ACM
15 years 10 months ago
AutoCardSorter: designing the information architecture of a web site using latent semantic analysis
In this paper, we describe an innovative tool that supports the design and evaluation of the information architecture of a Web site. The tool uses Latent Semantic Analysis and hie...
Christos Katsanos, Nikolaos K. Tselios, Nikolaos M...
VLSID
2002
IEEE
87views VLSI» more  VLSID 2002»
15 years 10 months ago
Simultaneous Circuit Transformation and Routing
In this paper, we propose a new methodology to integrate circuit transformation into routing. More specifically, this paper shows an approach for performing routing and wire recon...
Hiroaki Yoshida, Motohiro Sera, Masao Kubo, Masahi...
164
Voted
POPL
2007
ACM
15 years 10 months ago
Lock allocation
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
Michael Emmi, Jeffrey S. Fischer, Ranjit Jhala, Ru...
90
Voted
CADE
2001
Springer
15 years 10 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle