Sciweavers

9736 search results - page 88 / 1948
» How Fast Can We Compute Products
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
FCT
2007
Springer
15 years 8 months ago
Productivity of Stream Definitions
We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called `productive' if it can be evaluated ...
Jörg Endrullis, Clemens Grabmayer, Dimitri He...
ICHIM
2001
65views more  ICHIM 2001»
15 years 6 months ago
Dating and Authentication of Rembrandt's Etchings with the Help of Computational Intelligence
In this paper it is studied how the analysis of the structure of the paper of Rembrandt's etchings can help determining the authenticity of the etchings and the dates of the ...
Jan C. A. van der Lubbe, Eugene P. van Someren, Ma...
APSEC
2003
IEEE
15 years 10 months ago
An XVCL Approach to Handling Variants: A KWIC Product Line Example
We developed XVCL (XML-based Variant Configuration Language), a method and tool for product lines, to facilitate handling variants in reusable software assets (such as architectur...
Hongyu Zhang, Stan Jarzabek
CONEXT
2008
ACM
15 years 6 months ago
Uplink allocation beyond choke/unchoke: or how to divide and conquer best
Motivated by emerging cooperative P2P applications we study new uplink allocation algorithms for substituting the ratebased choke/unchoke algorithm of BitTorrent which was develop...
Nikolaos Laoutaris, Damiano Carra, Pietro Michiard...