Sciweavers

674 search results - page 14 / 135
» Subwebs for specialized search
Sort
View
SOCIALCOM
2010
13 years 5 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
Harish Sethu, Alexander Yates
JMLR
2010
143views more  JMLR 2010»
13 years 6 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
WWW
2005
ACM
14 years 8 months ago
The infocious web search engine: improving web searching through linguistic analysis
In this paper we present the Infocious Web search engine [23]. Our goal in creating Infocious is to improve the way people find information on the Web by resolving ambiguities pre...
Alexandros Ntoulas, Gerald Chao, Junghoo Cho
ICCS
2004
Springer
14 years 1 months ago
Local Search with Congestion in Complex Communication Networks
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
Alex Arenas, Leon Danon, Albert Díaz-Guiler...
IJNSEC
2011
143views more  IJNSEC 2011»
13 years 2 months ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma