Sciweavers

1716 search results - page 125 / 344
» Proving Conditional Termination
Sort
View
ACL
2012
11 years 11 months ago
Spectral Learning of Latent-Variable PCFGs
We introduce a spectral learning algorithm for latent-variable PCFGs (Petrov et al., 2006). Under a separability (singular value) condition, we prove that the method provides cons...
Shay B. Cohen, Karl Stratos, Michael Collins, Dean...
DM
2007
136views more  DM 2007»
13 years 9 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
SECON
2010
IEEE
13 years 6 months ago
Back-Tracking Based Sensor Deployment by a Robot Team
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...
PODC
2011
ACM
12 years 11 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
ICML
1998
IEEE
14 years 9 months ago
Intra-Option Learning about Temporally Abstract Actions
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
Richard S. Sutton, Doina Precup, Satinder P. Singh