Sciweavers

2372 search results - page 293 / 475
» Probabilistic calling context
Sort
View
IVC
2007
102views more  IVC 2007»
13 years 8 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
WWW
2008
ACM
13 years 8 months ago
KC3 browser: semantic mash-up and link-free browsing
This paper proposes a general framework of for a system with a semantic browsing and visualization interface called Knowledge Communication, Collaboration and Creation Browser (KC...
Michiaki Iwazume, Ken Kaneiwa, Koji Zettsu, Takafu...
ENTCS
2002
88views more  ENTCS 2002»
13 years 8 months ago
Testing Concurrent Java Programs using Randomized Scheduling
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
Scott D. Stoller
IAJIT
2010
133views more  IAJIT 2010»
13 years 6 months ago
Mediation Queries Adaptation After the Removal of a Data Source
: A broad variety of data is available in distinct heterogeneous sources, stored under different formats: database formats (in relational and object-oriented models), document form...
Latifa Baba-hamed
SIAMJO
2010
108views more  SIAMJO 2010»
13 years 6 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer