Sciweavers

976 search results - page 82 / 196
» The Complexity of Timetable Construction Problems
Sort
View
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
14 years 10 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
WWW
2007
ACM
14 years 9 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li
STACS
2005
Springer
14 years 2 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
14 years 2 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
TSP
2008
112views more  TSP 2008»
13 years 9 months ago
An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes
Abstract--We consider the problem of coding over a half-duplex wireless relay network where both the transmitter and the receiver have respectively several transmit and receive ant...
Frédérique E. Oggier, Babak Hassibi