Sciweavers

13214 search results - page 2358 / 2643
» Pseudorandomness for network algorithms
Sort
View
CN
2004
150views more  CN 2004»
15 years 6 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
15 years 6 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
TCSV
2002
101views more  TCSV 2002»
15 years 6 months ago
Error-resilient video transcoding for robust internetwork communications using GPRS
Abstract--A novel fully comprehensive mobile video communications system is proposed in this paper. This system exploits the useful rate management features of the video transcoder...
Safak Dogan, Akin Cellatoglu, Mustafa Uyguroglu, A...
TSMC
2002
142views more  TSMC 2002»
15 years 6 months ago
Adaptive color reduction
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
Nikos Papamarkos, Antonios Atsalakis, Charalambos ...
PVLDB
2008
205views more  PVLDB 2008»
15 years 6 months ago
Making SENSE: socially enhanced search and exploration
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...
« Prev « First page 2358 / 2643 Last » Next »