Sciweavers

416 search results - page 19 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
ECCC
2008
108views more  ECCC 2008»
13 years 7 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
CAGD
2005
93views more  CAGD 2005»
13 years 7 months ago
Simple local interpolation of surfaces using normal vectors
A simple algorithm for surface interpolation is proposed. Its central idea is quadratic interpolation of a curved segment from the position and normal vectors at the end points, w...
Takashi Nagata
DCC
1998
IEEE
13 years 12 months ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
14 years 1 months ago
A computationally efficient 3D shape rejection algorithm
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
Yinpeng Chen, Hari Sundaram