Sciweavers

863 search results - page 147 / 173
» The Light Bulb Problem
Sort
View
NIPS
2001
13 years 10 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
14 years 3 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler
COMPGEOM
2009
ACM
14 years 3 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang