10608 search results - page 118 / 2122 » Complexity of O'Hara's Algorithm |
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
80
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
97
Voted
AIIA
2007
Springer
15 years 6 months ago
2007
Springer
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
NPAR
2004
ACM
15 years 6 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
109
click to vote
ALGOSENSORS
2004
Springer
15 years 6 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...