Sciweavers

976 search results - page 165 / 196
» Evaluating Adversarial Partitions
Sort
View
PRL
2006
105views more  PRL 2006»
13 years 8 months ago
Parisian camera placement for vision metrology
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
TC
2008
13 years 8 months ago
Adaptive Channel Buffers in On-Chip Interconnection Networks - A Power and Performance Analysis
On-chip interconnection networks (OCINs) have emerged as a modular and scalable solution for wire delay constraints in deep submicron VLSI design. OCIN research has shown that the ...
Avinash Karanth Kodi, Ashwini Sarathy, Ahmed Louri
CG
2005
Springer
13 years 8 months ago
Combining geometry and domain knowledge to interpret hand-drawn diagrams
One main challenge in building interpreters for hand-drawn sketches is the task of parsing a sketch to locate the individual symbols. Many existing pen-based systems avoid this pr...
Leslie Gennari, Levent Burak Kara, Thomas F. Staho...
KBS
2007
56views more  KBS 2007»
13 years 8 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
BMCBI
2004
181views more  BMCBI 2004»
13 years 8 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon