Sciweavers

494 search results - page 98 / 99
» Heap Building Bounds
Sort
View
USS
2010
13 years 4 months ago
Idle Port Scanning and Non-interference Analysis of Network Protocol Stacks Using Model Checking
Idle port scanning uses side-channel attacks to bounce scans off of a "zombie" host to stealthily scan a victim IP address and determine if a port is open or closed, or ...
Roya Ensafi, Jong Chun Park, Deepak Kapur, Jedidia...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 4 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
EGH
2009
Springer
13 years 4 months ago
Object partitioning considered harmful: space subdivision for BVHs
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
Stefan Popov, Iliyan Georgiev, Rossen Dimov, Phili...
CN
2011
127views more  CN 2011»
13 years 2 months ago
A game theoretic analysis of network design with socially-aware users
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
TMC
2011
131views more  TMC 2011»
13 years 2 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan