Sciweavers

447 search results - page 26 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CAGD
2006
120views more  CAGD 2006»
13 years 7 months ago
Quality meshing of implicit solvation models of biomolecular structures
This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Prot...
Yongjie Zhang, Guoliang Xu, Chandrajit L. Bajaj
SIBGRAPI
2005
IEEE
14 years 1 months ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
WCNC
2008
IEEE
14 years 2 months ago
Integrated Source-Channel Decoding for Correlated Data-Gathering Sensor Networks
Abstract— This paper explores integrated source-channel decoding, driven by wireless sensor network applications where correlated information acquired by the network is gathered ...
Sheryl L. Howard, Paul G. Flikkema
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine