Sciweavers

5592 search results - page 456 / 1119
» On Random Betweenness Constraints
Sort
View
CSB
2003
IEEE
16 years 3 days ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
144
Voted
DATE
2003
IEEE
93views Hardware» more  DATE 2003»
16 years 3 days ago
Comparison of Test Pattern Decompression Techniques
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
Ondrej Novák
EVOW
2003
Springer
16 years 1 days ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
ECCV
2010
Springer
16 years 14 hour ago
On Parameter Learning in CRF-based Approaches to Object Class Image Segmentation
Recent progress in per-pixel object class labeling of natural images can be attributed to the use of multiple types of image features and sound statistical learning approaches. Wit...
ICDCS
2002
IEEE
15 years 11 months ago
Routing Indices For Peer-to-Peer Systems
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...
Arturo Crespo, Hector Garcia-Molina