Sciweavers

2100 search results - page 341 / 420
» Fundamentals of the problem
Sort
View
CAD
2005
Springer
13 years 9 months ago
Design automation for customized apparel products
This paper presents solution techniques for a three-dimensional Automatic Made-to-Measure (AMM) scheme for apparel products. Freeform surface is adopted to represent the complex g...
Charlie C. L. Wang, Yu Wang 0010, Matthew Ming-Fai...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
BMCBI
2006
122views more  BMCBI 2006»
13 years 9 months ago
A multivariate prediction model for microarray cross-hybridization
Background: Expression microarray analysis is one of the most popular molecular diagnostic techniques in the post-genomic era. However, this technique faces the fundamental proble...
Yian A. Chen, Cheng-Chung Chou, Xinghua Lu, Elizab...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 4 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret