903 search results - page 105 / 181 » Non-well-founded trees in categories |
175
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
141
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
139
click to vote
IUI
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new representation for describing routine tasks, called temporal task footprints. Routines are characterized by their temporal regularity or rhythm. Tempor...
161
click to vote
CIKM
2009
Springer
16 years 26 days ago
2009
Springer
We investigate the problem of determining the polarity of sentiments when one or more occurrences of a negation term such as “not” appear in a sentence. The concept of the sco...
157
click to vote
GECCO
2009
Springer
16 years 25 days ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...