Sciweavers

1950 search results - page 166 / 390
» Varieties of Increasing Trees
Sort
View
BILDMED
2011
245views Algorithms» more  BILDMED 2011»
14 years 9 months ago
Clustering-Based Detection of Anatomical Features on Organic Shapes
Abstract. Robust and accurate automatic detection of anatomical features on organic shapes is a challenging task. Despite a rough similarity, each shape is unique. To cope with thi...
Konrad Sickel, Vojtech Bubnik
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 10 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
DIS
2001
Springer
15 years 10 months ago
Computational Discovery of Communicable Knowledge: Symposium Report
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
Saso Dzeroski, Pat Langley
CORR
2002
Springer
142views Education» more  CORR 2002»
15 years 5 months ago
Learning Algorithms for Keyphrase Extraction
Many academic journals ask their authors to provide a list of about five to fifteen keywords, to appear on the first page of each article. Since these key words are often phrases ...
Peter D. Turney
POPL
2009
ACM
16 years 6 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...