Sciweavers

4526 search results - page 134 / 906
» Algorithmic problems related to the Internet
Sort
View
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 11 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 8 months ago
The weak password problem: chaos, criticality, and encrypted p-CAPTCHAs
- Vulnerabilities related to weak passwords are a pressing global economic and security issue. We report a novel, simple, and effective approach to address the weak password probl...
T. V. Laptyeva, S. Flach, K. Kladko
WWW
2006
ACM
16 years 5 months ago
Tables and trees don't mix (very well)
There are principal differences between the relational model and XML's tree model. This causes problems in all cases where information from these two worlds has to be brought...
Erik Wilde
CC
2007
Springer
157views System Software» more  CC 2007»
15 years 10 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
HSNMC
2003
Springer
102views Multimedia» more  HSNMC 2003»
15 years 9 months ago
A RTT-based Partitioning Algorithm for a Multi-rate Reliable Multicast Protocol
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
Moufida Maimour, CongDuc Pham