Sciweavers

6715 search results - page 1054 / 1343
» Learning from a Test Set
Sort
View
170
Voted
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
VR
2000
IEEE
101views Virtual Reality» more  VR 2000»
15 years 11 months ago
Multimodal Menu Presentation and Selection in Immersive Virtual Environments
Usability has become one of the key ingredients in making virtual reality (VR) systems work, and a big part of a usable VR system is in the design of effective interface/interacti...
Namgyu Kim, Gerard Jounghyun Kim, Chan-Mo Park, In...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 10 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
FASE
2006
Springer
15 years 10 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
A domain-based approach to predict protein-protein interactions
Background: Knowing which proteins exist in a certain organism or cell type and how these proteins interact with each other are necessary for the understanding of biological proce...
Mudita Singhal, Haluk Resat
« Prev « First page 1054 / 1343 Last » Next »