Sciweavers

1007 search results - page 75 / 202
» The Complexity of Futile Questioning
Sort
View
118
Voted
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
15 years 10 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
114
Voted
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
15 years 9 months ago
How OEMs and suppliers can face the network integration challenges
Systems integration is a major challenge in many industries. Systematic analysis of the complex integration effects, especially with respect to timing and performance, significant...
Kai Richter, Rolf Ernst
HUC
2005
Springer
15 years 9 months ago
From Interaction to Participation: Configuring Space Through Embodied Interaction
When computation moves off the desktop, how will it transform the new spaces that it comes to occupy? How will people encounter and understand these spaces, and how will they inter...
Amanda Williams, Eric Kabisch, Paul Dourish
120
Voted
DNA
2004
Springer
15 years 9 months ago
Parallelism in Gene Assembly
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organisms. This process is fascinatin...
Tero Harju, Chang Li, Ion Petre, Grzegorz Rozenber...
ITS
2004
Springer
105views Multimedia» more  ITS 2004»
15 years 9 months ago
EASE: Evolutional Authoring Support Environment
How smart should we be in order to cope with the complex authoring process of smart courseware? Lately this question gains more attention with attempts to simplify the process and ...
Lora Aroyo, Akiko Inaba, Larisa N. Soldatova, Riic...