Sciweavers

22 search results - page 1 / 5
» Searching for a k-clique in unknown graphs
Sort
View
ATAL
2010
Springer
13 years 3 months ago
Searching for a k-clique in unknown graphs
Roni Stern, Meir Kalech, Ariel Felner
COLT
1993
Springer
13 years 8 months ago
Piecemeal Learning of an Unknown Environment
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
Margrit Betke, Ronald L. Rivest, Mona Singh
EMNLP
2009
13 years 2 months ago
Graph Alignment for Semi-Supervised Semantic Role Labeling
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
Hagen Fürstenau, Mirella Lapata
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
13 years 10 months ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
CORR
2011
Springer
147views Education» more  CORR 2011»
12 years 11 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...