Sciweavers

1010 search results - page 184 / 202
» Measuring Similarity between Sets of Overlapping Clusters
Sort
View
73
Voted
FOCS
1993
IEEE
15 years 1 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
PATAT
2000
Springer
89views Education» more  PATAT 2000»
15 years 1 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
FPGA
1995
ACM
110views FPGA» more  FPGA 1995»
15 years 1 months ago
Testing of Uncustomized Segmented Channel Field Programmable Gate Arrays
This paper presents a methodology for production-time testing of (uncustomized) segmented channel eld programmable gate arrays (FPGAs) such as those manufactured by Actel [1]. Th...
Tong Liu, Wei-Kang Huang, Fabrizio Lombardi
ACL
2007
14 years 11 months ago
Supertagged Phrase-Based Statistical Machine Translation
Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system performance to deteriorate. In this work we show that i...
Hany Hassan, Khalil Sima'an, Andy Way
ICVGIP
2004
14 years 11 months ago
The Space of Human Shapes
We develop a novel method for fitting high-resolution template meshes to detailed human body range scans with sparse 3D markers. We formulate an optimization problem in which the ...
Brian Curless