Sciweavers

1322 search results - page 212 / 265
» Parameterized counting problems
Sort
View
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
14 years 4 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
CIKM
2009
Springer
14 years 4 months ago
Using domain ontology for semantic web usage mining and next page prediction
This paper proposes the integration of semantic information drawn from a web application’s domain knowledge into all phases of the web usage mining process (preprocessing, patte...
Nizar R. Mabroukeh, Christie I. Ezeife
CIKM
2009
Springer
14 years 4 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
14 years 4 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta
FGCN
2008
IEEE
116views Communications» more  FGCN 2008»
14 years 4 months ago
Routing in Degree-Constrained FSO Mesh Networks
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
Ziping Hu, Pramode K. Verma, James J. Sluss Jr.