Sciweavers

2834 search results - page 181 / 567
» Representing Trees with Constraints
Sort
View
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
14 years 2 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
GRAPHICSINTERFACE
2000
14 years 4 days ago
Dynamic Plane Shifting BSP Traversal
Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...
Stan Melax
ISMB
1993
14 years 3 days ago
Knowledge Discovery in GENBANK
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
Jeffery S. Aaronson, Juergen Haas, G. Christian Ov...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
14 years 4 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
ICDCS
2006
IEEE
14 years 4 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu