Sciweavers

9736 search results - page 76 / 1948
» How Fast Can We Compute Products
Sort
View
SPLC
2000
15 years 6 months ago
Development/maintenance/reuse: software evolution in product lines
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...
Stephen R. Schach, Amir Tomer
ICIP
2003
IEEE
16 years 6 months ago
Fast indexing for image retrieval based on local appearance with re-ranking
This paper describes an approach to retrieve images containing specific objects, scenes or buildings. The image content is captured by a set of local features. More precisely, we ...
Hao Shao, Tomás Svoboda, Vittorio Ferrari, ...
AAAI
1998
15 years 6 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
JDM
2010
75views more  JDM 2010»
15 years 3 months ago
Information Search Patterns in E-Commerce Product Comparison Services
The presentation of product information is very important in e-commerce websites. In this research, we study how disposition styles can influence users’ search patterns in produ...
Fiona Fui-Hoon Nah, Weiyin Hong, Liqiang Chen, Hon...
BMCBI
2006
145views more  BMCBI 2006»
15 years 4 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...