Search results for "Non-oblivious"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
69	Kazuo Iwama, Yasuo Okabe, Toshiro Takase	Separating Oblivious and Non-oblivious BPs.	COCOON	2001	DBLP DOI BibTeX RDF
60	Lasse Kliemann, Anand Srivastav	Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.	SEA	2009	DBLP DOI BibTeX RDF	hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding
53	Guillermo De Ita, David Eduardo Pinto, M. Nuño	Heuristics for Improving the Non-oblivious Local Search for MaxSAT.	IBERAMIA	1998	DBLP DOI BibTeX RDF
50	Constantinos Daskalakis, Christos H. Papadimitriou	On oblivious PTAS's for nash equilibrium.	STOC	2009	DBLP DOI BibTeX RDF	anonymous games, oblivious algorithms, PTAS, bimatrix games
44	Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis	Optimal, Distributed Decision-Making: The Case of No Communication.	FCT	1999	DBLP DOI BibTeX RDF
39	Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro	Time-Message Trade-Offs for the Weak Unison Problem.	CIAC	1994	DBLP DOI BibTeX RDF	Chordalrings, t-step protocol, Non-oblivious, Time-message complexity, Unbalanced, Unison, Wakeup protocol, Weak unison, Balanced, Anonymous network, Oblivious
34	Francesc Sebé, Josep Domingo-Ferrer	Oblivious Image Watermarking Robust against Scaling and Geometric Distortions.	ISC	2001	DBLP DOI BibTeX RDF	Oblivious watermarking, Multimedia copyright protection
31	Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos	On the Performance of Congestion Games for Optimum Satisfiability Problems.	WINE	2007	DBLP DOI BibTeX RDF	non oblivious local search, max sat, approximation algorithm, price of anarchy
28	Juraj Hromkovic, Martin Sauerhoff	Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.	STACS	2000	DBLP DOI BibTeX RDF
27	Domenico Dato, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando 0001, Raffaele Perego 0001, Nicola Tonellotto, Rossano Venturini	Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees.	ACM Trans. Inf. Syst.	2016	DBLP DOI BibTeX RDF
27	Justin Ward	Oblivious and Non-oblivious Local Search for Combinatorial Optimization.		2013	RDF
27	Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis	Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).	PODC	1997	DBLP DOI BibTeX RDF
25	Mark Cieliebak	Gathering Non-oblivious Mobile Robots.	LATIN	2004	DBLP DOI BibTeX RDF
25	Paola Alimonti	Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT.	WG	1997	DBLP DOI BibTeX RDF
19	Hamza Özer, Bülent Sankur, Nasir D. Memon	An SVD-based audio watermarking technique.	MM&Sec	2005	DBLP DOI BibTeX RDF	watermarking, singular value decomposition
19	Maria J. Serna, Fatos Xhafa	On Parallel versus Sequential Approximation.	ESA	1995	DBLP DOI BibTeX RDF
17	Artur Czumaj, Wojciech Rytter	Broadcasting Algorithms in Radio Networks with Unknown Topology.	FOCS	2003	DBLP DOI BibTeX RDF
17	Juraj Hromkovic	Communication Complexity and Lower Bounds on Multilective Computations.	MFCS	1998	DBLP DOI BibTeX RDF
15	Le Cong Dinh, David Henry Mguni, Long Tran-Thanh, Jun Wang, Yaodong Yang	A Summary of Online Markov Decision Processes with Non-oblivious Strategic Adversary.	AAMAS	2024	DBLP BibTeX RDF
15	Le Cong Dinh, David Henry Mguni, Long Tran-Thanh, Jun Wang 0012, Yaodong Yang 0001	Online Markov decision processes with non-oblivious strategic adversary.	Auton. Agents Multi Agent Syst.	2023	DBLP DOI BibTeX RDF
15	Maciej Skorski, Alessandro Temperoni	Exact Non-Oblivious Performance of Rademacher Random Embeddings.	CoRR	2023	DBLP DOI BibTeX RDF
15	Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan	Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise.	IEEE Trans. Inf. Theory	2022	DBLP DOI BibTeX RDF
15	Qixin Zhang, Zengde Deng, Zaiyi Chen, Yu Yang 0001	Continuous Submodular Maximization: Boosting via Non-oblivious Function.	CoRR	2022	DBLP BibTeX RDF
15	Qixin Zhang, Zengde Deng, Zaiyi Chen, Haoyuan Hu, Yu Yang 0001	Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function.	ICML	2022	DBLP BibTeX RDF
15	Olivier Carton, Joseph Vandehey	Preservation of Normality by Non-Oblivious Group Selection.	Theory Comput. Syst.	2021	DBLP DOI BibTeX RDF
15	Le Cong Dinh, David Henry Mguni, Long Tran-Thanh, Jun Wang 0012, Yaodong Yang 0001	Online Markov Decision Processes with Non-oblivious Strategic Adversary.	CoRR	2021	DBLP BibTeX RDF
15	Olivier Carton, Joseph Vandehey	Preservation of normality by non-oblivious group selection.	CoRR	2019	DBLP BibTeX RDF
15	Yi Xu, Haiqin Yang, Lijun Zhang 0005, Tianbao Yang	Efficient Non-Oblivious Randomized Reduction for Risk Minimization with Improved Excess Risk Guarantee.	AAAI	2017	DBLP DOI BibTeX RDF
15	Yi Xu, Haiqin Yang, Lijun Zhang 0005, Tianbao Yang	Efficient Non-oblivious Randomized Reduction for Risk Minimization with Improved Excess Risk Guarantee.	CoRR	2016	DBLP BibTeX RDF
15	Holger Petersen 0001	A Non-Oblivious Reduction of Counting Ones to Multiplication.	CoRR	2015	DBLP BibTeX RDF
15	Yuval Filmus, Justin Ward	Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search.	SIAM J. Comput.	2014	DBLP DOI BibTeX RDF
15	Asaf Levin, Uri Yovel	Uniform unweighted set cover: The power of non-oblivious local search.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
15	John Fearnley	Non-oblivious Strategy Improvement	CoRR	2010	DBLP BibTeX RDF
15	John Fearnley	Non-oblivious Strategy Improvement.	LPAR (Dakar)	2010	DBLP DOI BibTeX RDF
15	Asaf Levin, Uri Yovel	Uniform unweighted set cover: The power of non-oblivious local search	CoRR	2009	DBLP BibTeX RDF
15	Bhupendra Verma, Sanjeev Jain	A Spatial Domain Robust Non-Oblivious Watermarking Scheme for Image Database.	IICAI	2005	DBLP BibTeX RDF
15	Roberto Battiti, Marco Protasi	Solving MAX-SAT with non-oblivious functions and history-based heuristics.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
15	Paola Alimonti	Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems.	WG	1995	DBLP DOI BibTeX RDF
15	Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel	Non-Oblivious Hashing (Extended Abstract)	STOC	1988	DBLP DOI BibTeX RDF
15	Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines.	J. Comput. Syst. Sci.	1981	DBLP DOI BibTeX RDF
15	Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa	A time-space tradeoff for sorting and related non-oblivious computations.	SIGACT News	1979	DBLP DOI BibTeX RDF
15	Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines	FOCS	1979	DBLP DOI BibTeX RDF
11	Philipp Woelfel	Maintaining External Memory Efficient Hash Tables.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
9	C. Greg Plaxton, Torsten Suel	A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.	ICALP	1994	DBLP DOI BibTeX RDF
9	Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson	A Time-Space Tradeoff for Element Distinctness.	STACS	1986	DBLP DOI BibTeX RDF