Sciweavers

9842 search results - page 1817 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SC
2005
ACM
14 years 3 months ago
SPICE: Simulated Pore Interactive Computing Environment
— SPICE aims to understand the vital process of translocation of biomolecules across protein pores by computing the free energy profile of the translocating biomolecule along th...
Shantenu Jha, Peter V. Coveney, Matt J. Harvey
SI3D
2005
ACM
14 years 3 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
SIGCSE
2005
ACM
134views Education» more  SIGCSE 2005»
14 years 3 months ago
Enhancing team knowledge: instruction vs. experience
Information technology projects are growing in complexity and require teams to solve problems and develop solutions. With current undergraduate, computer science and information s...
Debra L. Smarkusky, Richard F. Dempsey, Joan J. Lu...
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
SPAA
2005
ACM
14 years 3 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
« Prev « First page 1817 / 1969 Last » Next »