Sciweavers

380 search results - page 63 / 76
» Instance Matching with COMA
Sort
View
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 25 days ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
14 years 4 days ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...
IJCV
2008
106views more  IJCV 2008»
13 years 7 months ago
Evaluation of Localized Semantics: Data, Methodology, and Experiments
We present a new data set encoding localized semantics for 1014 images and a methodology for using this kind of data for recognition evaluation. This methodology establishes protoc...
Kobus Barnard, Quanfu Fan, Ranjini Swaminathan, An...
JOT
2002
105views more  JOT 2002»
13 years 7 months ago
Java Distributed Separate Objects
Java supports distributed programming using threads and Remote Method Invocation (JRMI). However, a Java thread does not match well with the object concept, and JRMI cannot easily...
Miguel Katrib, Iskander Sierra, Mario del Valle, T...
NLE
2010
127views more  NLE 2010»
13 years 6 months ago
Class-based approach to disambiguating Levin verbs
Lapata and Brew (2004) (hereafter LB04) obtain from untagged texts a statistical prior model that is able to generate class preferences for ambiguous Levin (1993) verbs (hereafter...
Jianguo Li, Chris Brew