Sciweavers

935 search results - page 151 / 187
» Some Results on Orthogonal Factorizations
Sort
View
WG
2010
Springer
14 years 8 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
CASON
2010
IEEE
14 years 1 months ago
Social Network Reduction Based on Stability
—The analysis of social networks is concentrated especially on uncovering hidden relations and properties of network members (vertices). Most of the current approaches are focuse...
Milos Kudelka, Zdenek Horak, Václav Sn&aacu...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
15 years 4 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush