Sciweavers

16430 search results - page 758 / 3286
» On Computable Tree Functions
Sort
View
RECOMB
2002
Springer
16 years 7 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
MOBIHOC
2007
ACM
16 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
ECCV
2008
Springer
16 years 5 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
CCS
2009
ACM
16 years 2 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin
CLUSTER
2008
IEEE
16 years 1 months ago
Impact of topology and link aggregation on a PC cluster with Ethernet
Abstract—In addition to its use in local area networks, Ethernet has been used for connecting hosts in the area of highperformance computing. Here, we investigated the impact of ...
Takafumi Watanabe, Masahiro Nakao, Tomoyuki Hiroya...