Sciweavers

2434 search results - page 182 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
MP
1998
109views more  MP 1998»
15 years 3 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
IPPS
2010
IEEE
15 years 1 months ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann
ALGORITHMICA
2002
83views more  ALGORITHMICA 2002»
15 years 3 months ago
A Tutorial for Designing Flexible Geometric Algorithms
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
Vikas Kapoor, Dietmar Kühl, Alexander Wolff
ICML
2007
IEEE
16 years 4 months ago
Comparisons of sequence labeling algorithms and extensions
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...
Nam Nguyen, Yunsong Guo
MM
2000
ACM
166views Multimedia» more  MM 2000»
15 years 8 months ago
A video-based rendering acceleration algorithm for interactive walkthroughs
We present a new approach for faster rendering of large synthetic environments using video-based representations. We decompose the large environment into cells and pre-compute vid...
Andrew Wilson, Ming C. Lin, Boon-Lock Yeo, Minerva...