Sciweavers

11182 search results - page 1899 / 2237
» Shape Analysis of Sets
Sort
View
IGPL
2006
87views more  IGPL 2006»
15 years 7 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
IPL
2008
114views more  IPL 2008»
15 years 7 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
198
Voted
IPM
2008
139views more  IPM 2008»
15 years 7 months ago
Users can change their web search tactics: Design guidelines for categorized overviews
Categorized overviews of web search results are a promising way to support user exploration, understanding, and discovery. These search interfaces combine a metadata-based overvie...
Bill Kules, Ben Shneiderman
IPM
2008
196views more  IPM 2008»
15 years 7 months ago
Author identification: Using text sampling to handle the class imbalance problem
Authorship analysis of electronic texts assists digital forensics and anti-terror investigation. Author identification can be seen as a single-label multi-class text categorizatio...
Efstathios Stamatatos
IJON
2006
71views more  IJON 2006»
15 years 7 months ago
A neurocomputational model of stochastic resonance and aging
Stochastic resonance (SR) is fundamental to physical and biological processes. Here, we use a stochastic gain-tuning model to investigate interactions between aging-related increa...
Shu-Chen Li, Timo von Oertzen, Ulman Lindenberger
« Prev « First page 1899 / 2237 Last » Next »