Sciweavers

7380 search results - page 68 / 1476
» time 2008
Sort
View
CCCG
2008
13 years 11 months ago
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
ECCC
2008
107views more  ECCC 2008»
13 years 10 months ago
A Quantum Time-Space Lower Bound for the Counting Hierarchy
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
Dieter van Melkebeek, Thomas Watson
COGSCI
2006
67views more  COGSCI 2006»
13 years 10 months ago
The Action-Sentence Compatibility Effect: It's All in the Timing
When participants are asked to make sensibility judgments on sentences that describe action toward the body (i.e., "Mark dealt the cards to you") or away from the body (...
Kristin L. Borreggine, Michael P. Kaschak
COMPUTER
2006
51views more  COMPUTER 2006»
13 years 10 months ago
CASA and LEAD: Adaptive Cyberinfrastructure for Real-Time Multiscale Weather Forecasting
Beth Plale, Dennis Gannon, Jerry Brotzge, Kelvin D...
DM
2006
108views more  DM 2006»
13 years 10 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov