Sciweavers

3946 search results - page 441 / 790
» The computational complexity of choice sets
Sort
View
PERVASIVE
2006
Springer
15 years 6 months ago
Displays in the Wild: Understanding the Dynamics and Evolution of a Display Ecology
Large interactive display systems are becoming increasingly pervasive, but most have been studied in isolation, rather than in the context of other technologies in the environment....
Elaine M. Huang, Elizabeth D. Mynatt, Jay P. Trimb...
FGCS
2002
89views more  FGCS 2002»
15 years 6 months ago
The Legion support for advanced parameter-space studies on a grid
Parameter-space studies involve running a single application several times with different parameter sets. Since the jobs are mutually independent, many computing resources can be r...
Anand Natrajan, Marty A. Humphrey, Andrew S. Grims...
PRL
2002
95views more  PRL 2002»
15 years 6 months ago
Dissimilarity representations allow for building good classifiers
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
Elzbieta Pekalska, Robert P. W. Duin
MICCAI
2010
Springer
15 years 5 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
ACL
2010
15 years 4 months ago
Efficient Staggered Decoding for Sequence Labeling
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
Nobuhiro Kaji, Yasuhiro Fujiwara, Naoki Yoshinaga,...