Sciweavers

4377 search results - page 277 / 876
» Mass problems and randomness
Sort
View
ACL
2010
15 years 4 months ago
Expanding Verb Coverage in Cyc with VerbNet
A robust dictionary of semantic frames is an essential element of natural language understanding systems that use ontologies. However, creating lexical resources that accurately c...
Clifton McFate
ICIP
2010
IEEE
15 years 4 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
COCOA
2008
Springer
15 years 8 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
15 years 8 months ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir
ICONIP
1998
15 years 8 months ago
A Study on Initialization for BP Networks
This paper proposes an initialization of back propagation (BP) networks for pattern classification problems; the weights of hidden units are initialized so that hyperplanes should...
Hiroshi Shiratsuchi, Hiromu Gotanda, Katsuhiro Ino...