Sciweavers

425 search results - page 22 / 85
» On the additive constant of the k-server Work Function Algor...
Sort
View
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 7 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
MICCAI
2000
Springer
13 years 11 months ago
Robust 3D Segmentation of Anatomical Structures with Level Sets
This paper is focused on the use of the level set formalism to segment anatomical structures in 3D images (ultrasound ou magnetic resonance images). A closed 3D surface propagates...
C. Baillard, Christian Barillot
TSMC
2008
132views more  TSMC 2008»
13 years 7 months ago
Ensemble Algorithms in Reinforcement Learning
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and fin...
Marco A. Wiering, Hado van Hasselt
ICALP
2007
Springer
14 years 1 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie