Sciweavers

466 search results - page 90 / 94
» Fundamental Complexity of Optical Systems
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 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
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
14 years 8 months ago
Tumor cell identification using features rules
Advances in imaging techniques have led to large repositories of images. There is an increasing demand for automated systems that can analyze complex medical images and extract me...
Bin Fang, Wynne Hsu, Mong-Li Lee
BMCBI
2008
78views more  BMCBI 2008»
13 years 8 months ago
Deducing topology of protein-protein interaction networks from experimentally measured sub-networks
Background: Protein-protein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallym...
Ling Yang, Thomas M. Vondriska, Zhangang Han, W. R...
HPCA
2009
IEEE
14 years 8 months ago
Architectural Contesting
Previous studies have proposed techniques to dynamically change the architecture of a processor to better suit the characteristics of the workload at hand. However, all such appro...
Hashem Hashemi Najaf-abadi, Eric Rotenberg
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 8 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...